منابع مشابه
Solving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملA Multiagent System-approach for the Design of Information Systems in Virtual Organizations
This paper presents a design approach for information systems of virtual organizations which is based on the Distributed Artificial Intelligence (DAI) concept of Multiagent Systems (MAS). Viewing information retrieval within modern organizations as an inherently distributed problem we first evaluate in how far the main DAI architectures (Distributed Problem Solving (DPS), Cooperative Distribute...
متن کامل12th IEEE International Conference on Distributed Computing Systems '92, pp.614{621 Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called asynchronous backtracking that allows agents ...
متن کاملEvaluating Research in Cooperative Distributed Problem Solving
1This research was sponsored, in part, by the Defense Advanced Research Projects Agency (DOD), monitored by the Office of Naval Research under Contract NR049-041.
متن کاملDistributed Constraint Satisfaction for Formalizing Distributed Problem Solving
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called asynchronous backtracking that allows agents ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Knowl. Data Eng.
دوره 1 شماره
صفحات -
تاریخ انتشار 1989